Perfect Mendelsohn designs with block size six
نویسندگان
چکیده
منابع مشابه
Hpmds of Type 2 N 3 1 with Block Size Four and Related Hcolss
A holey perfect Mendelsohn design of type h n 1 1 h n 2 2 h n k k (HPMD(h n 1 1 h n 2 2 h n k k) with block size four is equivalent to a frame idempotent quasigroup satisfying Stein's third law with the same type, where a frame quasigroup of type h n 1
متن کاملSuper-simple balanced incomplete block designs with block size 5 and index 3
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple (v, 4, λ)BIBDs have been determined for λ = 2, 3, 4, 5, 6. In this paper, we investigate the existence...
متن کاملSelf-converse Mendelsohn designs with odd block size
A Mendelsohn design .M D(v, k,).) is a pair (X, B), where X is a vset together with a collection B of ordered k-tuples from X such that each ordered pair from X is contained in exactly ). k-tuples of B. An M D(v, k,).) is said to be self-converse, denoted by SC!'vf D( v, k,).) = (X,B,/), if there is an isomorphism / from (X, B) to (X,B), where B-1 {(Xk,:r:k-l, ... ,X2,Xl); (Xl,,,,,Xk) E B}. The...
متن کاملSuper-simple balanced incomplete block designs with block size 4 and index 5
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...
متن کاملSome existence and construction results of polygonal designs
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons). We present new polygonal designs with various parameter sets by explicit construction. In doing so we employ several construction methods – some conventional and some new. We also establish a link between a class of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 143 شماره
صفحات -
تاریخ انتشار 1995